Learning Boolean Halfspaces with Small Weights from Membership Queries
نویسندگان
چکیده
We consider the problem of proper learning a Boolean Halfspace with integer weights {0, 1, . . . , t} from membership queries only. The best known algorithm for this problem is an adaptive algorithm that asks n ) membership queries where the best lower bound for the number of membership queries is n [4]. In this paper we close this gap and give an adaptive proper learning algorithm with two rounds that asks n membership queries. We also give a non-adaptive proper learning algorithm that asks n ) membership queries.
منابع مشابه
Learning Intersections and Thresholds of Halfspaces
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any Boolean function of a polylog number of polynomial-weight halfspaces under any distribution on the Boolean hypercube. As special ...
متن کاملLearning Functions of Halfspaces using Prefix Covers
We present a simple query-algorithm for learning arbitrary functions of k halfspaces under any product distribution on the Boolean hypercube. Our algorithms learn any function of k halfspaces to within accuracy ε in time O((nk/ε)) under any product distribution on {0, 1} using read-once branching programs as a hypothesis.. This gives the first poly(n, 1/ε) algorithm for learning even the inters...
متن کاملLearning, Testing, and Approximating Halfspaces
A halfspace is a Boolean function of the form f(x) = sign(w · x− θ). Halfspaces (also known as linear threshold functions, weighted majority functions, threshold gates, Perceptrons, etc.) are a natural and wellstudied class of Boolean functions. We describe recent results on approximating, testing, and learning halfspaces. In more detail, • Every halfspace can be approximated by a halfspace wit...
متن کاملTesting ±1-Weight Halfspaces
We consider the problem of testing whether a Boolean function f : {−1, 1} → {−1, 1} is a±1-weight halfspace, i.e. a function of the form f(x) = sgn(w1x1+w2x2+· · ·+wnxn) where the weightswi take values in {−1, 1}. We show that the complexity of this problem is markedly different from the problem of testing whether f is a general halfspace with arbitrary weights. While the latter can be done wit...
متن کاملLearning Disjunctions of Predicates
LetF be a set of boolean functions. We present an algorithm for learningF∨ := {∨f∈Sf | S ⊆ F} from membership queries. Our algorithm asks at most |F| ·OPT(F∨) membership queries where OPT(F∨) is the minimum worst case number of membership queries for learning F∨. When F is a set of halfspaces over a constant dimension space or a set of variable inequalities, our algorithm runs in polynomial tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014